Constraint Logic Programming over Unions of Constraint Theories
نویسندگان
چکیده
In this paper, we present an extension of the Jaffar-Lassez constraint logic programming scheme that operates with unions of constraint theories with different signatures and decides the satisfiability of mixed constraints by appropriately combining the constraint solvers of the component theories. We describe the extended scheme, and provide logical and operational semantics for it along the lines of those given for the original scheme. We then show how the main soundness and completeness results of constraint logic programming lift to our extension.
منابع مشابه
Non-Disjoint Unions of Theories and Combinations of Satis ability Procedures: First Results
In this paper we outline a theoretical framework for the combination of decision procedures for the satis ability of constraints with respect to a constraint theory. We describe a general combination method which, given a procedure that decides constraint satis ability with respect to a constraint theory T1 and one that decides constraint satis ability with respect to a constraint theory T2, is...
متن کاملA New Correctness Proof of the {Nelson-Oppen} Combination Procedure
The Nelson-Oppen combination procedure, which combines satissabil-ity procedures for a class of rst-order theories by propagation of equalities between variables, is one of the most general combination methods in the eld of theory combination. We describe a new non-deterministic version of the procedure that has been used to extend the Constraint Logic Programming Scheme to unions of constraint...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملComplexity Results for First-Order Theories of Temporal Constraints
We study the complexity of quantiier elimination and decision in rst-order theories of temporal constraints. With the exception of Ladkin, AI researchers have largely ignored this problem. We consider the rst-order theories of point and interval constraints over two time structures: the integers and the ra-tionals. We show that in all cases quantiier-elimination can be done in PSPACE. We also s...
متن کاملCLP Entailment as Lazy Clause Generation
In this paper we present an algorithm for deciding entailment G |= H of properties G and H defined using Constraint Logic Programming (CLP). The algorithm is based on Satisfiability Modulo Theories (SMT) over a theory derived from the CLP program. The implementation is based on lazy clause generation. Existing methods for discharging such entailments rely on applying a set of proof rules (such ...
متن کامل